Semantic Search in Psychosis: Modeling Local Exploitation and Global Exploration
نویسندگان
چکیده
منابع مشابه
Search in patchy media: Exploitation-exploration tradeoff.
How to best exploit patchy resources? We introduce a minimal exploitation-migration model that incorporates the coupling between a searcher's trajectory, modeled by a random walk, and ensuing depletion of the environment by the searcher's consumption of resources. The searcher also migrates to a new patch when it takes S consecutive steps without finding resources. We compute the distribution o...
متن کاملExploration and Exploitation During Sequential Search
When we learn how to throw darts we adjust how we throw based on where the darts stick. Much of skill learning is computationally similar in that we learn using feedback obtained after the completion of individual actions. We can formalize such tasks as a search problem; among the set of all possible actions, find the action that leads to the highest reward. In such cases our actions have two o...
متن کاملBest-First Width Search: Exploration and Exploitation in Classical Planning
It has been shown recently that the performance of greedy best-first search (GBFS) for computing plans that are not necessarily optimal can be improved by adding forms of exploration when reaching heuristic plateaus: from random walks to local GBFS searches. In this work, we address this problem but using structural exploration methods resulting from the ideas of width-based search. Width-based...
متن کاملExploration and Exploitation in Memory Search Across the Lifespan
We used a formal model of memory (Raaijmakers & Shiffrin, 1981) to model semantic search processes of adults aged between 29 to 99 years of age in the animal naming task (“name all the animals you can”; Thurstone, 1938). Overall, our results support the idea that people switch between global frequency-based retrieval cues and local item-based retrieval cues to navigate their semantic memory. We...
متن کاملGradient Algorithms for Exploration/Exploitation Trade-Offs: Global and Local Variants
Gradient-following algorithms are deployed for efficient adaptation of exploration parameters in temporal-difference learning with discrete action spaces. Global and local variants are evaluated in discrete and continuous state spaces. The global variant is memory efficient in terms of requiring exploratory data only for starting states. In contrast, the local variant requires exploratory data ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Schizophrenia Bulletin Open
سال: 2020
ISSN: 2632-7899
DOI: 10.1093/schizbullopen/sgaa011